61 research outputs found

    Communication Primitives in Cognitive Radio Networks

    Full text link
    Cognitive radio networks are a new type of multi-channel wireless network in which different nodes can have access to different sets of channels. By providing multiple channels, they improve the efficiency and reliability of wireless communication. However, the heterogeneous nature of cognitive radio networks also brings new challenges to the design and analysis of distributed algorithms. In this paper, we focus on two fundamental problems in cognitive radio networks: neighbor discovery, and global broadcast. We consider a network containing nn nodes, each of which has access to cc channels. We assume the network has diameter DD, and each pair of neighbors have at least k1k\geq 1, and at most kmaxck_{max}\leq c, shared channels. We also assume each node has at most Δ\Delta neighbors. For the neighbor discovery problem, we design a randomized algorithm CSeek which has time complexity O~((c2/k)+(kmax/k)Δ)\tilde{O}((c^2/k)+(k_{max}/k)\cdot\Delta). CSeek is flexible and robust, which allows us to use it as a generic "filter" to find "well-connected" neighbors with an even shorter running time. We then move on to the global broadcast problem, and propose CGCast, a randomized algorithm which takes O~((c2/k)+(kmax/k)Δ+DΔ)\tilde{O}((c^2/k)+(k_{max}/k)\cdot\Delta+D\cdot\Delta) time. CGCast uses CSeek to achieve communication among neighbors, and uses edge coloring to establish an efficient schedule for fast message dissemination. Towards the end of the paper, we give lower bounds for solving the two problems. These lower bounds demonstrate that in many situations, CSeek and CGCast are near optimal

    Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks

    Get PDF

    Approximate Neighbor Counting in Radio Networks

    Get PDF
    For many distributed algorithms, neighborhood size is an important parameter. In radio networks, however, obtaining this information can be difficult due to ad hoc deployments and communication that occurs on a collision-prone shared channel. This paper conducts a comprehensive survey of the approximate neighbor counting problem, which requires nodes to obtain a constant factor approximation of the size of their network neighborhood. We produce new lower and upper bounds for three main variations of this problem in the radio network model: (a) the network is single-hop and every node must obtain an estimate of its neighborhood size; (b) the network is multi-hop and only a designated node must obtain an estimate of its neighborhood size; and (c) the network is multi-hop and every node must obtain an estimate of its neighborhood size. In studying these problem variations, we consider solutions with and without collision detection, and with both constant and high success probability. Some of our results are extensions of existing strategies, while others require technical innovations. We argue this collection of results provides insight into the nature of this well-motivated problem (including how it differs from related symmetry breaking tasks in radio networks), and provides a useful toolbox for algorithm designers tackling higher level problems that might benefit from neighborhood size estimates

    SECURING MULTI-CHANNEL WIRELESS NETWORKS AGAINST MALICIOUS BEHAVIOR

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Blocking Nuclear Factor-Kappa B Protects against Diet-Induced Hepatic Steatosis and Insulin Resistance in Mice

    Get PDF
    Inflammation critically contributes to the development of various metabolic diseases. However, the effects of inhibiting inflammatory signaling on hepatic steatosis and insulin resistance, as well as the underlying mechanisms remain obscure. In the current study, male C57BL/6J mice were fed a chow diet or high-fat diet (HFD) for 8 weeks. HFD-fed mice were respectively treated with p65 siRNA, non-silence control siRNA or vehicle every 4th day for the last 4 weeks. Vehicle-treated (HF) and non-silence siRNA-treated (HFNS) mice displayed overt inflammation, hepatic steatosis and insulin resistance compared with chow-diet-fed (NC) mice. Upon treatment with NF-κB p65 siRNA, HFD-fed (HFPS) mice were protected from hepatic steatosis and insulin resistance. Furthermore, Atg7 and Beclin1 expressions and p-AMPK were increased while p-mTOR was decreased in livers of HFPS mice in relative to HF and HFNS mice. These results suggest a crosslink between NF-κB signaling pathway and liver AMPK/mTOR/autophagy axis in the context of hepatic steatosis and insulin resistance

    Construction and validation of a glioblastoma prognostic model based on immune-related genes

    Get PDF
    BackgroundGlioblastoma multiforme (GBM) is a common malignant brain tumor with high mortality. It is urgently necessary to develop a new treatment because traditional approaches have plateaued.PurposeHere, we identified an immune-related gene (IRG)-based prognostic signature to comprehensively define the prognosis of GBM.MethodsGlioblastoma samples were selected from the Chinese Glioma Genome Atlas (CGGA). We retrieved IRGs from the ImmPort data resource. Univariate Cox regression and LASSO Cox regression analyses were used to develop our predictive model. In addition, we constructed a predictive nomogram integrating the independent predictive factors to determine the one-, two-, and 3-year overall survival (OS) probabilities of individuals with GBM. Additionally, the molecular and immune characteristics and benefits of ICI therapy were analyzed in subgroups defined based on our prognostic model. Finally, the proteins encoded by the selected genes were identified with liquid chromatography-tandem mass spectrometry and western blotting (WB).ResultsSix IRGs were used to construct the predictive model. The GBM patients were categorized into a high-risk group and a low-risk group. High-risk group patients had worse survival than low-risk group patients, and stronger positive associations with multiple tumor-related pathways, such as angiogenesis and hypoxia pathways, were found in the high-risk group. The high-risk group also had a low IDH1 mutation rate, high PTEN mutation rate, low 1p19q co-deletion rate and low MGMT promoter methylation rate. In addition, patients in the high-risk group showed increased immune cell infiltration, more aggressive immune activity, higher expression of immune checkpoint genes, and less benefit from immunotherapy than those in the low-risk group. Finally, the expression levels of TNC and SSTR2 were confirmed to be significantly associated with patient prognosis by protein mass spectrometry and WB.ConclusionHerein, a robust predictive model based on IRGs was developed to predict the OS of GBM patients and to aid future clinical research
    corecore